Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Thereexistawiderangeofapplicationswhereasigni?cantfractionofthe- mentum and energy present in a physical problem is carried by the transport of particles. Depending on the speci?capplication, the particles involved may be photons, neutrons, neutrinos, or charged particles. Regardless of which phenomena is being described, at the heart of each application is the fact that a Boltzmann like transport equation has to be solved. The complexity, and hence expense, involved in solving the transport problem can be understood by realizing that the general solution to the 3D Boltzmann transport equation is in fact really seven dimensional: 3 spatial coordinates, 2 angles, 1 time, and 1 for speed or energy. Low-order appro- mations to the transport equation are frequently used due in part to physical justi?cation but many in cases, simply because a solution to the full tra- port problem is too computationally expensive. An example is the di?usion equation, which e?ectively drops the two angles in phase space by assuming that a linear representation in angle is adequate. Another approximation is the grey approximation, which drops the energy variable by averaging over it. If the grey approximation is applied to the di?usion equation, the expense of solving what amounts to the simplest possible description of transport is roughly equal to the cost of implicit computational ?uid dynamics. It is clear therefore, that for those application areas needing some form of transport, fast, accurate and robust transport algorithms can lead to an increase in overall code performance and a decrease in time to solution.

Computer science --- informatica --- informaticaonderzoek

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book provides an overview of the emerging field of in situ visualization, i.e. visualizing simulation data as it is generated. In situ visualization is a processing paradigm in response to recent trends in the development of high-performance computers. It has great promise in its ability to access increased temporal resolution and leverage extensive computational power. However, the paradigm also is widely viewed as limiting when it comes to exploration-oriented use cases. Furthermore, it will require visualization systems to become increasingly complex and constrained in usage. As research efforts on in situ visualization are growing, the state of the art and best practices are rapidly maturing. Specifically, this book contains chapters that reflect state-of-the-art research results and best practices in the area of in situ visualization. Our target audience are researchers and practitioners from the areas of mathematics computational science, high-performance computing, and computer science that work on or with in situ techniques, or desire to do so in future. .

Computer science --- informatica --- informaticaonderzoek

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book collects the major part of the lectures given at ENUMATH 2005, the Sixth European Conference on Numerical Mathematics and Advanced Applications, that took place in Santiago de Compostela, Spain, from July 18 to 22, 2005. It contents text of invited speakers, and a selection of papers presented in minisymposia and contributed sessions. Topics include applications such as atmosphere and ocean, water pollution, electromagnetism, interface problems, waves, finance, heat transfer, unbounded domains, numerical linear algebra, convection-diffusion, fluid-structure, plates, solids, hyperbolic equations, multiphase flow, Navier-Stokes, singular perturbation problems, non linear PDE, control, parabolic equations, as well as methodologies such as a posteriori error estimates, discontinuous Galerkin methods, multiscale methods, optimization, adaptive methods, domain decomposition techniques, exponential integrators, hp-finite elements, level set methods, fractional step methods, penalty procedures, and finite volumes. The book gives an extensive overview of the most recent research in scientific computing, providing to the reader the latest developments concerning the mathematical issues and the applications of this active field of science.

Computer science --- Computer. Automation --- informatica --- wiskunde --- informaticaonderzoek

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

As Computer Science progressively matures as an established discipline, it becomes increasingly important to revisit its theoretical foundations, learn the appropriate techniques for answering theory-based questions, and build one's confidence in implementing this knowledge when building computer applications. Students well-grounded in theory and abstract models of computation can excel in computing's many application arenas. Through a deft interplay of rigor and intuitive motivation, Elements of Computation Theory comprehensively, yet flexibly provides students with the grounding they need in computation theory. The book is self-contained and introduces the fundamental concepts, models, techniques, and results that form the basic paradigms of computing. Readers will benefit from the discussion of the ideas and mathematics that computer scientists use to model, to debate, and to predict the behavior of algorithms and computation. Previous learning about set theory and proof by induction are helpful prerequisites. Topics and features: ¢ Contains an extensive use of definitions, proofs, exercises, problems, and other pedagogical aids ¢ Supplies a summary, bibliographical remarks, and additional (progressively challenging) problems in each chapter, as well as an appendix containing hints and answers to selected problems ¢ Reviews mathematical preliminaries such as set theory, relations, graphs, trees, functions, cardinality, Cantor's diagonalization, induction, and the pigeon-hole principle ¢ Explores regular languages, covering the mechanisms for representing languages, the closure properties of such languages, the existence of other languages, and other structural properties ¢ Investigates the class of context-free languages, including context-free grammars, Pushdown automata, their equivalence, closure properties, and existence of non-context-free languages ¢ Discusses the true nature of general algorithms, introducing unrestricted grammars, Turing machines, and their equivalence ¢ Examines which tasks can be achieved by algorithms and which tasks can't, covering issues of decision problems in regular languages, context-free languages, and computably enumerable languages ¢ Provides a concise account of both space and time complexity, explaining the main techniques of log space reduction, polynomial time reduction, and simulations ¢ Promotes students' confidence via interactive learning and motivational, yet informal dialogue ¢ Emphasizes intuitive aspects and their realization with rigorous formalization Undergraduate students of computer science, engineering, and mathematics will find this core textbook ideally suited for courses on the theory of computation, automata theory, formal languages, and computational models. Computing professionals and other scientists will also benefit from the work's accessibility, plethora of learning aids, and motivated exposition. Dr. Arindama Singh is a professor at the Department of Mathematics of the Indian Institute of Technology Madras and has authored books on logic for computer science.

Computer science --- toegepaste informatica --- informatica --- informaticaonderzoek

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- Computer. Automation --- informatica --- wiskunde --- informaticaonderzoek